Packing Designs with Block Size 5 and Index 2: The Case v Even
نویسندگان
چکیده
An (v, •, 2) packing design of order v, block size ~, and index 2 is a collection of ~:-element subsets, called blocks, of a set V such that every 2-subsets of V occurs in at most 2 blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we provide a powerful technique for constructing designs and solve the packing problem in the case tc = 5, 2 = 2, and v is even. © 1993 Academic Press, Inc.
منابع مشابه
Packing designs with block size 6 and index 5
Assaf, A.M., A. Hartman and N. Shalaby, Packing designs with block size 6 and index 5, Discrete Mathematics 103 (1992) 121-128. A (v, K, A) packing design of order v, block size K and index 1 is a collection of K-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most I blocks. The packing problem is to determine the maximum number of blocks in a packing des...
متن کاملOn packing designs with block size 5 and indices 3 and 5
Let V be a finite set of order v. A (V,K,A) packing design of index A and block size IC is a collection of K-element subsets, called blocks, such that every 2-subset of V occurs in at most A blocks. The packing problem is to determine the maximum number of blocks, D(V,K,A), in a packing design. It is well known that D(V,K,A) S [-i [:=~ ~]] : : t(VIK,~), where [xl is the largest integer satisfyi...
متن کاملPacking Designs with Block Size 5 and Indexes 8, 12, 16
A (u, K, 1) packing design of order o, block size K, and index I is a collection of K-element subsets, called blocks of a set V such that every 2-subset of V occurs in at most 1 blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve the packing problem with K = 5, 1=8, 12, 16, and all positive integers o with the possible exceptions ...
متن کاملDirected packings with block size 5 and odd v
Let DD(5, 1; v) denote the packing number of a directed packing with block size 5 and index unity. It has been determined in [10] that DD(5, 1; v) = l2(:-1 JJ where v even. In this paper, the values of DD(5, 1; v) for all v are determined, with the possible exceptions of v 15, 19, 27.
متن کاملBipacking pairs by quintuples: The case nu=13 (mod 20)
A (v, K, A) packing design of order v, block size K, and index 1 is a collection of K-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most L blocks. The packing problem is to determine the maximum number of blocks in a packing design. Packing with 1= 2 is called bipacking. In this paper we solve the bipacking problem in the case K = 5 and v = 13 (mod 20).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 63 شماره
صفحات -
تاریخ انتشار 1993